A MIP-Tabu Search Hybrid Framework for Multicommodity Capacitated Fixed-Charge Network Design
نویسندگان
چکیده
This paper addresses the capacitated multicommodity fixed-charge network design problem, a particular case of the broad class network design problems. To identify good quality solutions, we propose a matheuristic combining an exact MIP method and a Tabu search meta-heuristic. A new arc-balanced cycle procedure for generating neighboring solutions is introduced. To assess the quality of the solutions, tight lower bounds are computed using a cutting-plane procedure. During the computation process, memories characterizing attributes of solutions are compiled. These memories are then used to find good quality starting solutions in short computational times. Computational results conducted on a large set of instances with various characteristics show an efficient behavior of the proposed method. The method provides high quality feasible solutions which outperformed those obtained by state-of-the-art optimization codes within the time allowed.
منابع مشابه
Learning Mechanisms and Local Search Heuristics for the Fixed Charge Capacitated Multicommodity Network Design
In this paper, we propose a method based on learning mechanisms to address the fixed charge capacitated multicommodity network design problem. Learning mechanisms are applied on each solution to extract meaningful fragments to build a pattern solution. Cycle-based neighborhoods are used both to generate solutions and to move along a path leading to the pattern solution by a tabu-like local sear...
متن کاملPath Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design
In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along path between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate tha...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملA Simplex-Based Tabu Search Method for Capacitated Network Design
The fixed charge capacitated multicommodity network design problem is a well-known problem, of both practical and theoretical significance. This paper presents an efficient procedure to determine tight upper bounds on the optimal solution of realistically sized problem instances. Feasible solutions are obtained by using a tabu search framework that explores the space of the continuous flow vari...
متن کاملCycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
We propose new cycle-based neighbourhood structures for meta-heuristics aimed at the fixedcharge capacitated multicommodity network design formulation. The neighbourhood defines moves that take explicitly into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously. Moves are identified through a shortest path-like ne...
متن کامل